Further connections between contract-scheduling and ray-searching problems

This paper addresses two classes of different, yet interrelated optimization problems. The first class problems involves a mobile searcher that must locate hidden target in an environment consists set unbounded, concurrent rays. second pertains to the design interruptible algorithms by means schedule contract algorithms. Both types capture fundamental aspects resource allocation under uncertainty. We study several variants these families problems, such as searching and scheduling with probabilistic considerations, redundancy fault-tolerance issues, randomized strategies, trade-offs between performance preemptions. For many we present known results apply multi-ray multi-problem domains. Our objective is demonstrate well-motivated settings can be addressed using same underlying approach.